import java.util.Scanner;

public class Test {
    public static void printArray(int arr[]){
        for (int i = 1; i <= 100; i++) {
            System.out.print(arr[i-1] + " ");
            if(i%10==0){
                System.out.println();
            }
        }
    }
    public static void main(String[] args) {
        int[] arr = new int[100];
        for (int i = 0; i < 100; i++) {
            arr[i] = i+1;
        }
        printArray(arr);
    }

    public static void hanota(int n,char pos1,char pos2,char pos3) {
        if(n == 1){
            move(pos1,pos3);
            return;
        }
        hanota(n-1,pos1,pos3,pos2);
        move(pos1,pos3);
        hanota(n-1,pos2,pos1,pos3);
    }
    public static void move(char pos1,char pos2) {
        System.out.print(pos1+"->"+pos2+ " ");
    }

    public static void main6(String[] args) {
    hanota(1,'A','B','C');
        System.out.println();
    hanota(2,'A','B','C');
        System.out.println();
    hanota(3,'A','B','C');
    }


    public static int fib(int n){
        if(n == 1 || n == 2) {
            return 1;
        }
            return  fib(n-1) + fib(n-2);
    }
    public static void main5(String[] args) {
        System.out.println(fib(4));
    }





    public static int sum1(int n){
        if(n <= 9){
            return n;
        }
        int tmp = n%10 + sum1(n/10);
        return tmp;
    }
    public static void main4(String[] args) {
        System.out.println(sum1(12345));
    }



    public static void fun1(int n){
        if(n<=9){
            System.out.print(n%10+" ");
            return;
        }
        fun1(n/10);
        System.out.print(n%10+" ");
    }
    public static void main3(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        fun1(n);
    }




    public static  int sum(int n) {
        if(n == 1){
            return 1;
        }
        return n+sum(n-1);
    }
    public static void main2(String[] args) {
        //递归求 1 + 2 + 3 + ... + 10
        int n = 10;
        System.out.println(sum(n));

    }




    public static  int fac(int n){
        if(n == 1){
            return 1;
        }
        int tmp = n* fac(n-1);
        return tmp;
    }
    public static void main1(String[] args) {
        //递归求N的阶乘
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        System.out.println(fac(n));

    }
}
